Optimizing e-commerce last-mile vehicle routing and scheduling under uncertain customer presence

The recent increase in online orders e-commerce leads to logistical challenges such as low hit rates (proportion of successful deliveries). We consider last-mile vehicle routing and scheduling problems which customer presence probability data are taken into account. aim is reduce the expected cost resulting from by considering both decisions simultaneously planning phase. model problem solve it means an adaptive large neighborhood search metaheuristic iterates between components problem. Computational experiments indicate that using customer-related significantly can yield savings 40% system-wide costs compared with those traditional solutions.